SUMS OF SQUARES, MOMENT MATRICES AND OPTIMIZATION OVER POLYNOMIALS MONIQUE LAURENT∗ Updated version: February 6, 2010 Abstract. We consider the problem of minimizing a polynomial over a semialgebraic set defined by pol

Source URL: homepages.cwi.nl

• Mathematics
• Algebra
• Real algebraic geometry
• Mathematical optimization
• Operations research
• Matrices
• Linear programming
• Semidefinite programming
• Polynomial
• Moment problem
• Moment matrix
• Matrix

RTGBeing Stubborn: Developing Optimal Solution Strategies for a Scheduling Problem Despite its NP-Hardness Dr. Oliver Sinnen Department of Electrical and Computer Engineering

Source URL: grk1855.tu-dortmund.de

• Computational complexity theory
• Theory of computation
• Combinatorial optimization
• Complexity classes
• Operations research
• Integer programming
• Heuristic
• Branch and bound
• NP
• Optimization problem
• Pruning
• Reduction

Forced Liquidations, Fire Sales, and the Cost of Illiquidity Richard R. Lindsey and Andrew B. Weisman∗ February 2, 2015 “Vee try to tell them dat our problem was not a solfency problem but a likvitity problem, but th

Source URL: www.q-group.org

• Financial markets
• Financial economics
• Financial risk
• Valuation
• Mathematical finance
• Market liquidity
• Liquidity risk
• Hedge fund
• Portfolio optimization
• Fair value
• Private equity secondary market
• Convertible arbitrage

dJay: Enabling High-density Multi-tenancy for Cloud Gaming Servers with Dynamic Cost-Benefit GPU Load Balancing Sergey Grizan, David Chu, Alec Wolman, Roger Wattenhofer Challenge Density Optimization Problem

Source URL: acmsocc.github.io

• Image processing
• Structural similarity

In RoboCup 2003: Robot Soccer World Cup VII, LNCS VolDaniel Polani, et al., eds, pages 43-53, Springer-Verlag, Berlin Heidelberg, 2004 On role allocation in RoboCup? Brian P. Gerkey1 and Maja J Matari´c2 1

Source URL: robotics.stanford.edu

• Mathematics
• Mathematical optimization
• Combinatorial optimization
• Combinatorics
• Greedy algorithm
• Matroid theory
• Assignment problem
• Robot
• Algorithm
• Pareto efficiency
• IranOpen
• Fair item assignment

2 First Order Methods for Nonsmooth Convex Large-Scale Optimization, II: Utilizing Problem’s Structure

Source URL: ljk.imag.fr

Social Exchange Networks With Distant BargainingI Konstantinos Georgiou1 , George Karakostas2,∗, Jochen K¨onemann1 , Zuzanna Stamirowska3 Abstract Network bargaining is a natural extension of the classical, 2-player N

Source URL: www.cas.mcmaster.ca

• Computational complexity theory
• Game theory
• Theory of computation
• Computational problems
• Cooperative game theory
• Core
• NC
• Optimization problem

SUMS OF SQUARES, MOMENT MATRICES AND OPTIMIZATION OVER POLYNOMIALS MONIQUE LAURENT∗ May 8, 2008 Abstract. We consider the problem of minimizing a polynomial over a semialgebraic set defined by polynomial equations and

Source URL: homepages.cwi.nl

Lydia B. Chilton Research Statement I build hybrid human-computer systems that combine the strengths of human and machine intelligence to solve problems that neither one could solve independently. People have innate prob

Source URL: hmslydia.com

• Theoretical computer science
• Computer programming
• Software engineering
• Operations research
• Mathematics
• Crowdsourcing
• Algorithm
• Human-based computation
• Mathematical optimization
• Humancomputer interaction
• Problem solving
• Recursion